A ug 2 00 1 One - dimensional quantum chaos : Explicitly solvable cases
نویسندگان
چکیده
We present quantum graphs with remarkably regular spectral characteristics. We call them regular quantum graphs. Although regular quantum graphs are strongly chaotic in the classical limit, their quantum spectra are explicitly solvable in terms of periodic orbits. We present analytical solutions for the spectrum of regular quantum graphs in the form of explicit and exact periodic orbit expansions for each individual energy level.
منابع مشابه
ua nt - p h / 03 01 00 3 v 1 3 J an 2 00 3 Explicit , analytical solution of scaling quantum graphs
Based on earlier work on regular quantum graphs we show that a large class of scaling quantum graphs with arbitrary topology are explicitly analytically solvable. This is surprising since quantum graphs are excellent models of quantum chaos and quantum chaotic systems are not usually explicitly analytically solvable.
متن کاملJ an 2 00 3 Explicit , analytical solution of scaling quantum graphs
Based on earlier work on regular quantum graphs we show that a large class of scaling quantum graphs with arbitrary topology are explicitly analytically solvable. This is surprising since quantum graphs are excellent models of quantum chaos and quantum chaotic systems are not usually explicitly analytically solvable.
متن کاملExplicitly solvable cases of one-dimensional quantum chaos.
We identify a set of quantum graphs with unique and precisely defined spectral properties called regular quantum graphs. Although chaotic in their classical limit with positive topological entropy, regular quantum graphs are explicitly solvable. The proof is constructive: we present exact, convergent periodic orbit expansions for individual energy levels, thus obtaining an analytical solution f...
متن کاملar X iv : 0 70 8 . 23 75 v 1 [ nl in . C D ] 1 7 A ug 2 00 7 Resummation and the semiclassical theory of spectral statistics
We address the question as to why, in the semiclassical limit, classically chaotic systems generically exhibit universal quantum spectral statistics coincident with those of Random Matrix Theory. To do so, we use a semiclassical resummation formalism that explicitly preserves the unitarity of the quantum time evolution by incorporating duality relations between short and long classical orbits. ...
متن کاملua nt - p h / 03 02 03 5 v 1 4 F eb 2 00 3 Solution of scaling quantum networks
We show that all scaling quantum graphs are explicitly integrable, i.e. any one of their spectral eigenvalues En is computable analytically, explicitly, and individually for any given n. This is surprising, since quantum graphs are excellent models of quantum chaos [see, e.g., T. Kottos and H. Schanz, Physica E 9, 523 (2001)]. 05.45.Mt Typeset using REVTEX 1 Graphs are networks of bonds and ver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008